Cloud Point Curve and Critical Point of Multicomponent Polymer/Single Solvent System
نویسندگان
چکیده
منابع مشابه
Tracking Point-Curve Critical Distances
This paper presents a novel approach to continuously and robustly tracking critical (geometrically, perpendicular and/or extremal) distances from a moving plane point p ∈ R to a static parametrized piecewise rational curve γ(s) (s ∈ R). The approach is a combination of local marching, and the detection and computation of global topological change, both based on the differential properties of a ...
متن کاملDynamic Compression of Curve-Based Point Cloud
With the increasing demands for highly detailed 3D data, dynamic scanning systems are capable of producing 3D+t (a.k.a. 4D) spatio-temporal models with millions of points recently. As a consequence, effective 4D geometry compression schemes are required to face the need to store/transmit the huge amount of data, in addition to classical static 3D data. In this paper, we propose a 4D spatio-temp...
متن کاملA Barcode Shape Descriptor for Curve Point Cloud Data
In this paper, we present a complete computational pipeline for extracting a compact shape descriptor for curve point cloud data (PCD). Our shape descriptor, called a barcode, is based on a blend of techniques from differential geometry and algebraic topology. We also provide a metric over the space of barcodes, enabling fast comparison of PCDs for shape recognition and clustering. To demonstra...
متن کاملInterval B-Spline Curve Evaluation Bounding Point Cloud
We present an algorithm for bounding a piece of strip-shaped point cloud without self-intersections with an interval B-spline curve. Firstly we calculate the boundary points of the point cloud, and then bound it with an interval B-spline curve of which two pieces of boundary curves interpolate these boundary points. For the algorithm there are important applications in product shape verifying m...
متن کاملElliptic Curve Point Multiplication
New type of elliptic curve point multiplication is proposed, where complex multiplication by 2 − or by 2 ) 7 1 ( − ± is used instead of point duplication. This allows speeding up multiplication about 1.34 times. Using higher radix makes it possible to use one point duplication instead of two and to speed-up computation about 1.6 times. The method takes prime group order factorization: ρ ρ = r a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polymer Journal
سال: 1984
ISSN: 0032-3896,1349-0540
DOI: 10.1295/polymj.16.839